A Lower Bound for Power-Aware Task Scheduling on Multiprocessor Computers

We address task scheduling on multiprocessor computers with dynamically variable voltage and speed as a combinatorial optimization problem. We define the problem of minimizing schedule length with energy consumption constraint on multiprocessor computers. We derive a lower bound for the optimal schedule length for the problem of minimizing schedule length with energy consumption constraint.